Strong law of large numbers on graphs and groups

نویسندگان

  • Natalia Mosina
  • Alexander Ushakov
چکیده

We introduce the notion of the mean-set (expectation) of a graph(group-) valued random element ξ and prove a generalization of the strong law of large numbers on graphs and groups. Furthermore, we prove an analogue of the classical Chebyshev’s inequality for ξ. We show that our generalized law of large numbers, as a new theoretical tool, provides a framework for practical applications; namely, it has implications for cryptanalysis of groupbased authentication protocols. In addition, we prove several results about configurations of mean-sets in graphs and their applications. In particular, we discuss computational problems and methods of computing of mean-sets in practice and propose an algorithm for such computation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Strong Law of Large Numbers

Petrov (1996) proved the connection between general moment conditions and the applicability of the strong law of large numbers to a sequence of pairwise independent and identically distributed random variables. This note examines this connection to a sequence of pairwise negative quadrant dependent (NQD) and identically distributed random variables. As a consequence of the main theorem ...

متن کامل

MARCINKIEWICZ-TYPE STRONG LAW OF LARGE NUMBERS FOR DOUBLE ARRAYS OF NEGATIVELY DEPENDENT RANDOM VARIABLES

In the following work we present a proof for the strong law of large numbers for pairwise negatively dependent random variables which relaxes the usual assumption of pairwise independence. Let be a double sequence of pairwise negatively dependent random variables. If for all non-negative real numbers t and , for 1 < p < 2, then we prove that (1). In addition, it also converges to 0 in ....

متن کامل

On the Convergence Rate of the Law of Large Numbers for Sums of Dependent Random Variables

In this paper, we generalize some results of Chandra and Goswami [4] for pairwise negatively dependent random variables (henceforth r.v.’s). Furthermore, we give Baum and Katz’s [1] type results on estimate for the rate of convergence in these laws.

متن کامل

On global (strong) defensive alliances in some product graphs

A defensive alliance in a graph is a set $S$ of vertices with the property that every vertex in $S$ has at most one moreneighbor outside of $S$ than it has inside of $S$. A defensive alliance $S$ is called global if it forms a dominating set. The global defensive alliance number of a graph $G$ is the minimum cardinality of a global defensive alliance in $G$. In this article we study the global ...

متن کامل

Probability on Graphs and Groups: Theory and Applications

PROBABILITY ON GRAPHS AND GROUPS: THEORY AND APPLICATIONS Natalia Mosina We introduce the notion of the mean-set (expectation) of a graphor groupvalued random element. Using this concept, we prove a novel generalization of the strong law of large numbers on graphs and groups. Some other relevant results about configurations of mean-sets (or center-sets) in trees and free groups, which may be of...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Groups Complexity Cryptology

دوره 3  شماره 

صفحات  -

تاریخ انتشار 2011